Interesting Examples on Maximal Irreducible Goppa Codes

نویسنده

  • Marta Giorgetti
چکیده

In this paper a full categorization of irreducible classical Goppa codes of degree 4 and length 9 is given. It is an interesting example in the context of find the number of permutation non-equivalent classical irreducible maximal Goppa codes having fixed parameters q, n and r using group theory techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permutation equivalent maximal irreducible Goppa codes

We consider the problem of finding the number of permutation nonequivalent classical irreducible maximal Goppa codes having fixed parameters q, n and r from a group theory point of view.

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

Counting Extended Irreducible Goppa Codes

We obtain an upper bound on the number of extended irreducible q-ary Goppa codes of degree r and length q + 1, where q = p and n and r > 2 are prime numbers.

متن کامل

Enumeration of inequivalent irreducible Goppa codes

We consider irreducible Goppa codes over Fq of length q n defined by polynomials of degree r where q is a prime power and n, r are arbitrary positive integers. We obtain an upper bound on the number of such codes.

متن کامل

Cumulative-Separable Codes

A t first Γ(L,G)-codes were introduced by V.D.Goppa [1] in 1970. These codes are a large and powerful class of error correcting codes. F.J. McWilliams and N.J. Sloane [2] defined these codes as the most important class of alternant codes. It is known that there are Γ(L,G)-codes that reach the Gilbert-Varshamov bound and that many Γ(L,G)-codes are placed in the Table of the best known codes [3]....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009